On some semilattice structures for production technologies
نویسندگان
چکیده
Tracing back from Charnes, Cooper and Rhodes [9] many approaches have been proposed to extend the DEA production model to non-convex technologies. The FDH method were introduced by Deprins, Simar and Tulkens [13] and it only assumes a free disposal assumption of the technology. This paper, continues further an earlier work by Briec and Horvath [7]. Among other things, a new class of semilattice production technologies is introduced. Duality results as well as computational issues are proposed.
منابع مشابه
SOME INTUITIONISTIC FUZZY CONGRUENCES
First, we introduce the concept of intuitionistic fuzzy group congruenceand we obtain the characterizations of intuitionistic fuzzy group congruenceson an inverse semigroup and a T^{*}-pure semigroup, respectively. Also,we study some properties of intuitionistic fuzzy group congruence. Next, weintroduce the notion of intuitionistic fuzzy semilattice congruence and we givethe characterization of...
متن کاملUniformities and covering properties for partial frames (II)
This paper is a continuation of [Uniformities and covering properties for partial frames (I)], in which we make use of the notion of a partial frame, which is a meet-semilattice in which certain designated subsets are required to have joins, and finite meets distribute over these. After presenting there our axiomatization of partial frames, which we call $sels$-frames, we added structure, in th...
متن کاملA note on the problem when FS-domains coincide with RB-domains
In this paper, we introduce the notion of super finitely separating functions which gives a characterization of RB-domains. Then we prove that FS-domains and RB-domains are equivalent in some special cases by the following three claims: a dcpo is an RB-domain if and only if there exists an approximate identity for it consisting of super finitely separating functions; a consistent join-semilatti...
متن کاملOn semilattice-based logics with an algebraizable assertional companion
This paper studies some properties of the so-called semilattice-based logics (which are defined in a standard way using only the order relation from a variety of algebras that have a semilattice reduct with maximum) under the assumption that its companion assertional logic (defined from the same variety of algebras using the top element as representing truth) is algebraizable. This describes a ...
متن کاملDistributive Semilattices as Retracts of Ultraboolean Ones; Functorial Inverses without Adjunction
A 〈∨, 0〉-semilattice is ultraboolean, if it is a directed union of finite Boolean 〈∨, 0〉-semilattices. We prove that every distributive 〈∨, 0〉-semilattice is a retract of some ultraboolean 〈∨, 0〉-semilattice. This is established by proving that every finite distributive 〈∨, 0〉-semilattice is a retract of some finite Boolean 〈∨, 0〉-semilattice, and this in a functorial way. This result is, in tu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 215 شماره
صفحات -
تاریخ انتشار 2011